µ-Calculus with Explicit Points and Approximations

On global induction mechanisms in a µ-calculus with explicit approximations

On the Structure of Inductive Reasoning: Circular and Tree-Shaped Proofs in the µ-Calculus

In this paper we study induction in the context of the firstorder μ-calculus with explicit approximations. We present and compare two Gentzen-style proof systems each using a different type of induction. The first is based on finite proof trees and uses a local well-founded induction rule, while the second is based on (finitely represented) ω-regular proof trees and uses a global induction disc...

ar X iv : h ep - l at / 9 90 80 06 v 1 5 A ug 1 99

Experiments with imaginary chemical potential and Glasgow method carried out in two interrelated models – four dimensional QCD in the infinite coupling limit, and one dimensional QCD – support the point of view expressed by the title. The profound differences of dense, cold matter , and hot, moderately dense, hadron gas might be reflected by different performances of numerical approaches to fin...

Automatic Abstraction Techniques for Propositional µ-calculus Model Checking

An abstraction/reenement paradigm for the full propositional-calculus is presented. No distinction is made between universal or ex-istential fragments. Necessary conditions for conservative veriication are provided, along with a fully automatic symbolic model checking abstraction algorithm. The algorithm begins with conservative veriication of an initial abstraction. If the conclusion is negati...

A Note on Global Induction Mechanisms in a -calculus with Explicit Approximations